Canonical Dynamic Programming Equations subject to Ambiguity
نویسندگان
چکیده
منابع مشابه
Posynomial geometric programming problem subject to max–product fuzzy relation equations
In this article, we study a class of posynomial geometric programming problem (PGPF), with the purpose of minimizing a posynomial subject to fuzzy relational equations with max–product composition. With the help of auxiliary variables, it is converted convert the PGPF into an equivalent programming problem whose objective function is a non-decreasing function with an auxiliary variable. Some pr...
متن کاملExplaining and Controlling Ambiguity in Dynamic Programming
Ambiguity in dynamic programming arises from two independent sources, the non-uniqueness of optimal solutions and the particular recursion scheme by which the search space is evaluated. Ambiguity, unless explicitly considered, leads to unnecessarily complicated, in exible, and sometimes even incorrect dynamic programming algorithms. Building upon the recently developed algebraic approach to dyn...
متن کاملUr Scholarship Repository Is ' Argument' Subject to the Product/process Ambiguity? Is 'argument' Subject to the Product/process Ambiguity?
The product/process distinction with regards to “argument” has a longstanding history and foundational role in argumentation theory. I shall argue that, regardless of one’s chosen ontology of arguments, arguments are not the product of some process of arguing. Hence, appeal to the distinction is distorting the very organizational foundations of argumentation theory and should be abandoned. Resu...
متن کاملa dynamic programming solution to solute transport and dispersion equations in groundwater
the partial differential equations for water flow and solute transport in a two-dimensional saturated domain are rendered discrete using the finite difference technique; the resulting system of algebraic equations is solved using a dynamic programming (dp) method. the advantage of the dp algorithm is that the problem is converted from solving an algebraic system of order nc(nl-1) nc(nl-1) into...
متن کاملLocal minimization algorithms for dynamic programming equations
The numerical realization of the dynamic programming principle for continuous-time optimal control leads to nonlinear Hamilton-Jacobi-Bellman equations which require the minimization of a nonlinear mapping over the set of admissible controls. This minimization is often performed by comparison over a finite number of elements of the control set. In this paper we demonstrate the importance of an ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2020
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2020.12.533